Persistent Homology of Collaboration Networks
نویسندگان
چکیده
We apply persistent homology to four collaboration networks. We show that the intervals for the zeroth and first Betti numbers correspond to tangible features of the structure of these networks. Finally, we use persistent homology to distinguish collaboration networks from similar random networks.
منابع مشابه
Persistent Path Homology of Directed Networks Samir Chowdhury and Facundo
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a construction of homology of digraphs due to Grigor’yan, Lin, Muranov and Yau, and extend this construction to the persistent framework. The result, which we call pe...
متن کاملPersistent Path Homology of Directed Networks Samir Chowdhury and Facundo Mémoli
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We extend a construction of homology of digraphs due to Grigoryan, Lin, Muranov and Yau to the persistent framework. The result, which we call persistent path homology or PPH,...
متن کاملAdversary Detection in Neural Networks via Persistent Homology
We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to output distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these induced graphs, we observe that the structure of the most persistent subgraphs ...
متن کاملCosheaf Theoretical Constructions in Networks and Persistent Homology
In this paper, we study data flows in directed networks with a hierarchical recurrent structure from a cosheaf theoretical perspective. We utilize the visual parametrization of directed recurrent programs provided in persistence diagrams for cosheaf theoretical constructions. In considering cosheaves on persistence diagrams, we link global network structure and local recurrent process data. An ...
متن کاملPersistent Homology of Asymmetric Networks: an Approach Based on Dowker Filtrations
We propose methods for computing two network features with topological underpinnings: the Rips and Dowker Persistent Homology Diagrams. Our formulations work for general networks, which may be asymmetric and may have any real number as an edge weight. We study the sensitivity of Dowker persistence diagrams to intrinsic asymmetry in the data, and investigate the stability properties of both the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012